A Framework to Support Continuous Range Queries over Multi-Attribute Trajectories

نویسندگان

چکیده

Emerging applications over spatio-temporal trajectories require representing the data from diverse aspects. We study multi-attribute each of which consists a sequence time-stamped locations and set attributes characterizing investigate continuous range queries trajectories. Such query returns whose contain expected values are always within distance threshold to trajectory during entire overlapping time period. To efficiently answer query, an optimal method partitioning is proposed index structure developed support combined search using both parameters attribute values. Query algorithms auxiliary structures developed, accompanied with optimization strategies thorough theoretical analysis. Using real synthetic datasets, we carry out comprehensive experiments in prototype database system evaluate efficiency scalability our designs. The experimental results show that approach outperforms six alternative approaches by factor 5-50x on large datasets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

A Multi-attribute Reverse Auction Framework Under Uncertainty to the Procurement of Relief Items

One of the main activities of humanitarian logistics is to provide relief items for survivors in case of a disaster. To facilitate the procurement operation, this paper proposes a bidding framework for supplier selection and optimal allocation of relief items. The proposed auction process is divided into the announcement construction, bid construction and bid evaluation phases. In the announcem...

متن کامل

Range Queries over DHTs

Distributed Hash Tables (DHTs) are scalable peer-to-peer systems that support exact match lookups. This paper describes the construction and use of a Prefix Hash Tree (PHT) – a distributed data structure that supports range queries over DHTs. PHTs use the hash-table interface of DHTs to construct a search tree that is efficient (insertions/lookups take DHT lookups, where D is the data domain be...

متن کامل

Continuous Queries Over Eddies

We present a continuous query system built on top of Eddies, a query-processing engine which replaces static query plans with per-tuple dynamic routing decisions. We discuss why this implementation is superior to traditional continuous query schemes, and present encouraging initial performance results which demonstrate the scalability and efficiency of our system.

متن کامل

Database-support for Continuous Prediction Queries over Streaming Data

Prediction is emerging as an essential ingredient for real-time monitoring, planning and decision support applications such as intrusion detection, e-commerce pricing and automated resource management. This paper presents a system that efficiently supports continuous prediction queries (CPQs) over streaming data using seamlessly-integrated probabilistic models. Specifically, we describe how to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering

سال: 2021

ISSN: ['1558-2191', '1041-4347', '2326-3865']

DOI: https://doi.org/10.1109/tkde.2021.3100650